Penanganan Fuzzy Time Window pada Travelling Salesman Problem (TSP) dengan Penerapan Algoritma Genetika
نویسندگان
چکیده
منابع مشابه
Classical Travelling Salesman Problem (TSP) based Approach to Solve Fuzzy TSP using Yager’s Ranking
Bellman RE, Zadeh LA . 1970. Decision-making in a fuzzy environment, Manage. Sci. , 17: 141-164. Hannan EL 1981. Linear programming with multiple fuzzy goals. Fuzzy Sets Syst. , 6: 235-248 Hansen MP 2000. Use of substitute Scalarizing Functions to guide Local Search based Heuristics: The case of MOTSP, J. Heuristics, 6: 419-431 Jaszkiewicz A 2002. Genetic Local Search for Multiple Objectives Co...
متن کاملBeam-ACO for the travelling salesman problem with time windows
The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel-cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method combining ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and comput...
متن کاملModified Ant Colony Optimizer (MACO) for the Travelling Salesman Problem (TSP)
Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature. Meta-heuristic approaches have proved to be quite useful for approximate solution of difficult combinatorial optimization problems. Ant colony optimization is one of the popular Meta-heuristics and is unique on the basis of its distributed computation and indirect communicatio...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملA Survey on Travelling Salesman Problem
The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus it highly raises the need for an efficient solution for this NP Hard problem. However even the most common deterministic solutions to the problem are known to possess an exponential t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATICS
سال: 2017
ISSN: 2477-2550,1978-161X
DOI: 10.18860/mat.v9i1.4072